Algorithms to estimating fractal dimension of textured images
نویسندگان
چکیده
Two algorithms that can obtain more accurate estimate of the fractal dimension are proposed. One is the shifting DBC (SDBC) algorithm and the other one is the scanning BC (SBC) algorithm. It is theoretically proven that the SDBC algorithm approaches the estimated value closer to the exact fractal dimension than the DBC method. Simulation results show that the proposed algorithms consistently give more satisfactory results on textured images.
منابع مشابه
Near optimum estimation of local fractal dimension for image segmentation
This paper presents an algorithm for estimating the local fractal dimension (LFD) of textured images. The algorithm is established by an experimental approach based on the blanket method. The proposed method uses the near optimum number of blankets to obtain the LFD for a small local window. The robustness of the proposed method to consistently estimate the LFD using up to a 3 3 local window is...
متن کاملProbabilistic pseudo-morphology for grayscale and color images
Mathematical morphology offers popular image processing tools, successfully used for binary and grayscale images. Recently, its extension to color images has become of interest and several approaches were proposed. Due to various issues arising from the vectorial nature of the data, none of them imposed as a generally valid solution. We propose a probabilistic pseudo-morphological approach, by ...
متن کاملEvaluation of methods for estimating fractal properties of intensity images
We have evaluated nine different methods for estimating the fractal dimension of intensity images based on their accuracy, spread and robustness to noise. For this purpose we have generated some 6000 digital images with varying size and known fractal properties. To observe the influence of noise we have distorted these images with Poisson noise, Gaussian noise of different strength and point sp...
متن کاملImage Processing Applications Based on Texture and Fractal Analysis
Texture analysis research attempts to solve two important kinds of problems: texture segmentation and texture classification. In some applications, textured image segmentation can be solved by classification of small regions obtained from image partition. Two classes of features are proposed in the decision theoretic recognition problem for textured image classification. The first class derives...
متن کاملMeasuring Watermarking Robustness Using Fractal Dimensions
The authors present a new approach for measuring watermarking robustness in the case of color attacks of rgb-color watermarked images. This approach is applied to evaluate the robustness of our algorithm to watermark an rgb-color image by modifying pixels colors. It is based on Kolmogorov-Smirnov test and it uses fractal dimensions to quantify modified color pixels. The authors test smooth and ...
متن کامل